Anderson Acceleration of the Arnoldi-Inout Method for Computing PageRank

Anderson(m0) extrapolation, an accelerator to a fixed-point iteration, stores m0+1 prior evaluations of the iteration and computes linear combination those as new iteration. The computational cost acceleration becomes expensive with parameter m0 increasing, thus is common choice in most practice. In this paper, aim improving computations PageRank problems, method was developed by applying Anderson(1) extrapolation at periodic intervals within Arnoldi-Inout method. called AIOA Convergence analysis discussed detail. Numerical results on several problems are presented illustrate effectiveness our proposed